A General Clause Theorem Prover
نویسنده
چکیده
Introduction The General Clause Theorem Prover (GCTP) was designed as a test bed for semantic search control strategies in theorem proving. It is the unique combination of the Graph Construction (GC) procedure of [Shostak 1976] (which is known to out-perform many (all?) linear format systems), embedding the axioms of equality by the use of the Resolution by Unification and Equality (RUE) and Negative Reflexive Function (NRF) inference rules [Digricoli 1979]. To use RUE and NRF in the GC procedure, three modifications have been made. (i) Extension is is redefined to use RUE unification; (ii) NRF is added, and applied to negative equality Bliterals as an alternative to extension; (iii) Reduction is redefined to use RUE unification. In all three cases, negative equality literals generated from the use of RUE unification are classified as B-literals and added to the right hand end of the result chain. The completeness of the combination of the GC procedure and the RUE and NRF inference rules, is to be obtained by combining their respective completeness results.
منابع مشابه
Distributed Deduction by Clause-Diffusion: The Aquarius Prover
Aquarius is a distributed theorem prover for first order logic with equality, developed for a network of workstations. Given in input a theorem proving problem and the number n of active nodes, Aquarius creates n deductive processes, one on each workstation, which work cooperatively toward the solution of the problem. Aquarius realizes a specific variant of a general methodology for distributed...
متن کاملDistributed Deduction by Clause-Diffusion: Distributed Contraction and the Aquarius Prover
Aquarius is a distributed theorem prover for first order logic with equality, developed for a network of workstations. Given as input a theorem proving problem and a number n of active nodes, Aquarius creates n deductive processes, one on each workstation, which work cooperatively toward the solution of the problem. Aquarius realizes a number of variants of a general methodology for distributed...
متن کاملScavenger 0.1: A Theorem Prover Based on Conflict Resolution
This paper introduces Scavenger, the first theorem prover for pure first-order logic without equality based on the new conflict resolution calculus. Conflict resolution has a restricted resolution inference rule that resembles (a first-order generalization of) unit propagation as well as a rule for assuming decision literals and a rule for deriving new clauses by (a first-order generalization o...
متن کاملSystem Description : E 1 . 8 Stephan Schulz
E is a theorem prover for full first-order logic with equality. It reduces first-order problems to clause normal form and employs a saturation algorithm based on the equational superposition calculus. E is built on shared terms with cached rewriting, and employs several innovations for efficient clause indexing. Major strengths of the system are automatic problem analysis and highly flexible se...
متن کاملExtending E Prover with Similarity Based Clause Selection Strategies
E prover is a state-of-the-art theorem prover for first-order logic with equality. E prover is built around a saturation loop, where new clauses are derived by inference rules from previously derived clauses. Selection of clauses for the inference provides the main source of nondeterminism and an important choice-point of the loop where the right choice can dramatically influence the proof sear...
متن کامل